package fun.coding.jeffreys.judge;

public class FindPeakElementInMatrix {
	public static void main(String[] args) {

	}
	
	/**
	 * Given a n by n matrix filled with integers, find one element that is larger than its four neighbors.
	 * If there is multiple ones, return anyone is fine. You can assume all boundaries are infinitely small
	 * 
	 *   2   9   3  1
	 *   6   3   2  5
	 *   1   7   4  8    
 	 *   0   2   2  1
 	 *   
 	 *   9, 6, 7, 8 are all peak
	 */	
	public int findPeak(int[][] matrix) {
		return 0;
	}

}
